Generalized Block Shift Network for Clusters
نویسندگان
چکیده
In this brief, a generalized topology of block shift networks (BSNs), named generalized block shift network (GBSN), is proposed for interconnection networks in clusters. The BSNs possess many desirable topological features, such as flexibility in node degree, small diameter and average distance, and easy VLSI implementation. However, the regular structure of each block in the BSN is not suitable for the networks in clusters that usually have arbitrary number of nodes. The proposed GBSN offers a balance between regularity and irregularity of the interconnection networks for clusters. We also analyze the embedding of the BSN into the GBSN, and discuss the versatility of the GBSN in terms of slowdown factors compared to the BSN.
منابع مشابه
Parallelizing the Camellia and SMS4 Block Ciphers
The n-cell GF-NLFSR (Generalized Feistel-NonLinear Feedback Shift Register) structure [8] is a generalized unbalanced Feistel network that can be considered as a generalization of the outer function FO of the KASUMI block cipher. An advantage of this cipher over other n-cell generalized Feistel networks, e.g. SMS4 [11] and Camellia [5], is that it is parallelizable for up to n rounds. In hardwa...
متن کاملParallelizing the Camellia and SMS4 Block Ciphers - Extended version
The n-cell GF-NLFSR (Generalized Feistel-NonLinear Feedback Shift Register) structure [8] is a generalized unbalanced Feistel network that can be considered as a generalization of the outer function FO of the KASUMI block cipher. An advantage of this cipher over other n-cell generalized Feistel networks, e.g. SMS4 [11] and Camellia [5], is that it is parallelizable for up to n rounds. In hardwa...
متن کاملLI-YORKE CHAOTIC GENERALIZED SHIFT DYNAMICAL SYSTEMS
In this text we prove that in generalized shift dynamical system $(X^Gamma,sigma_varphi)$ for finite discrete $X$ with at least two elements, infinite countable set $Gamma$ and arbitrary map $varphi:GammatoGamma$, the following statements are equivalent: - the dynamical system $(X^Gamma,sigma_varphi)$ is Li-Yorke chaotic; - the dynamical system $(X^Gamma,sigma_varphi)$ has an scr...
متن کاملA generalized ABFT technique using a fault tolerant neural network
In this paper we first show that standard BP algorithm cannot yeild to a uniform information distribution over the neural network architecture. A measure of sensitivity is defined to evaluate fault tolerance of neural network and then we show that the sensitivity of a link is closely related to the amount of information passes through it. Based on this assumption, we prove that the distribu...
متن کاملCOUNTEREXAMPLES IN CHAOTIC GENERALIZED SHIFTS
In the following text for arbitrary $X$ with at least two elements, nonempty countable set $Gamma$ we make a comparative study on the collection of generalized shift dynamical systems like $(X^Gamma,sigma_varphi)$ where $varphi:GammatoGamma$ is an arbitrary self-map. We pay attention to sub-systems and combinations of generalized shifts with counterexamples regarding Devaney, exact Dev...
متن کامل